Some localization theorems on hamiltonian circuits
نویسندگان
چکیده
The self-archived postprint version of this journal article is available at Linköping University Institutional Repository (DiVA): http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143287 N.B.: When citing this work, cite the original publication. Hasratian, A. S, Khachatrian, N. K, (1990), Some localization theorems on hamiltonian circuits, Journal of combinatorial theory. Series B (Print), 49(2), 287-294. https://doi.org/10.1016/00958956(90)90032-U
منابع مشابه
Some new localization theorems on Hamiltonian properties
Let G be a 2-connected graph with n ?: 3 vertices such that for any two vertices u, v at distance two in an induced subgraph K 1,3 or P4 of G, the inequality d(u) + d(v) ?: IN(u) U N(v) U N(w)ls holds for all w E N(u) n N(v). We prove that (i) if s = 1 and IN(u) n N(v)1 ?: 2, then G is hamiltonian or K p,p+1 ~ G ~ Kp + K p+1; (ii) if s = 0, then G is either pancyclic, or bipartite graph. This g...
متن کاملua nt - p h / 01 11 06 0 v 1 9 N ov 2 00 1 Localization and causality for a free particle
Theorems (most notably by Hegerfeldt) prove that an initially localized particle whose time evolution is determined by a positive Hamiltonian will violate causality. We argue that this apparent paradox is resolved for a free particle described by either the Dirac equation or the Klein-Gordon equation because such a particle cannot be localized in the sense required by the theorems.
متن کامل0 v 2 2 8 Fe b 20 03 Localization and causality for a free particle
Theorems (most notably by Hegerfeldt) prove that an initially localized particle whose time evolution is determined by a positive Hamiltonian will violate causality. We argue that this apparent paradox is resolved for a positive energy free particle described by either the Dirac equation or the Klein-Gordon equation because such a particle cannot be localized in the sense required by the theorems.
متن کاملAn Algorithm Which Generates the Hamiltonian Circuits of a Cubic Planar Map
The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map which include some chosen edge of the map. A simple extension of the method results in the generation of all the Hamiltonian circuits of the map. The algorithm can readily be implemented on a digital computer, subject to limitations on storage. A general property of the generating function de...
متن کاملEvolutionary Hamiltonian Graph Theory
We present an alternative domain concerning mathematics to investigate universal evolution mechanisms by focusing on large cycles theory (LCT)-a simplified version of well-known hamiltonian graph theory. LCT joins together a number of N P-complete cycle problems in graph theory. N P-completeness is the kay factor insuring (by conjecture of Cook) the generation of endless developments and great ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 49 شماره
صفحات -
تاریخ انتشار 1990